Sub-4.7 Scaling Exponent of Polar Codes
نویسندگان
چکیده
Polar codes approach channel capacity provably and empirically are thereby a constituent code of the 5G standard. Compared to low-density parity-check codes, however, performance short-length polar have rooms for improvement that could hinder its adoption by wider class applications. As part program addresses issue at short length, it is crucial understand how fast binary memoryless symmetric channels polarize. A number, called scaling exponent, was defined measure speed polarization several estimates exponent were given in literature. 2022, tightest overestimate 4.714 made Mondelli, Hassani, Urbanke 2015. We lower 4.63. The idea behind this that, instead describing relation between W children ◻ ⊛, we describe grandchildren ◻◻, ◻⊛, ⊛◻, ⊛⊛. By doing so, evolution becomes “less Markovian” hence more tighter inequalities can be obtained.
منابع مشابه
Scaling Exponent and Moderate Deviations Asymptotics of Polar Codes for the AWGN Channel
This paper investigates polar codes for the additive white Gaussian noise (AWGN) channel. The scaling exponent μ of polar codes for a memoryless channel qY |X with capacity I(qY |X) characterizes the closest gap between the capacity and non-asymptotic achievable rates in the following way: For a fixed ε ∈ (0, 1), the gap between the capacity I(qY |X) and the maximum non-asymptotic rate R n achi...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملScaling Exponent for Incremental Records
We investigate records in a growing sequence of identical and independently distributed random variables. The record equals the largest value in the sequence, and our focus is on the increment, defined as the difference between two successive records. We investigate sequences in which all increments decrease monotonically, and analyze the case where the random variables are drawn from a uniform...
متن کاملConvolutional Polar Codes
Arikan’s Polar codes [1] attracted much attention as the first efficiently decodable and capacity achieving codes. Furthermore, Polar codes exhibit an exponentially decreasing block error probability with an asymptotic error exponent upper bounded by β < 1 2 . Since their discovery, many attempts have been made to improve the error exponent and the finite block-length performance, while keeping...
متن کاملOn Polar Grassmann Codes
In this note we offer a short summary of the content of the lecture on polar Grassmann codes given at the Indian Intitute of Technology, Mumbai, during the International Conference on Algebraic Geometry and Coding Theory in December 2013. More precisely, we consider the codes arising from the projective system determined by the image ε k (∆k) of the Grassmann embedding ε gr k of an orthogonal G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2023
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2023.3253074